Dynamic Multilevel Graph Visualization

نویسنده

  • Todd L. Veldhuizen
چکیده

We adapt multilevel, force-directed graph layout techniques to visualizing dynamic graphs in which vertices and edges are added and removed in an online fashion (i.e., unpredictably). We maintain multiple levels of coarseness using a dynamic, randomized coarsening algorithm. To ensure the vertices follow smooth trajectories, we employ dynamics simulation techniques, treating the vertices as point particles. We simulate fine and coarse levels of the graph simultaneously, coupling the dynamics of adjacent levels. Projection from coarser to finer levels is adaptive, with the projection determined by an affine transformation that evolves alongside the graph layouts. The result is a dynamic graph visualizer that quickly and smoothly adapts to changes in a graph.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A dynamic multiscale magnifying tool for exploring large sparse graphs

Received: 9 January 2008 Revised: 3 March 2008 Online publication date: 17 April 2008 Abstract We present an information visualization tool, known as GreenMax, to visually explore large small-world graphswith up to amillion graph nodes on a desktop computer. A major motivation for scanning a small-world graph in such a dynamic fashion is the demanding goal of identifying not just the well-known...

متن کامل

A Multilevel Gamma-Clustering Layout Algorithm for Visualization of Biological Networks

Visualization of large complex networks has become an indispensable part of systems biology, where organisms need to be considered as one complex system. The visualization of the corresponding network is challenging due to the size and density of edges. In many cases, the use of standard visualization algorithms can lead to high running times and poorly readable visualizations due to many edge ...

متن کامل

A Web-oriented Framework for Graph Simplification and Interactive Visualization

The web-based visualization of large graph data is attracting much attention and brings new challenges to researchers, especially in visualization speed and data scale. Based on the idea of connected dominating set, we introduce the representative dominating sub graph (RDSG) to quickly simplify large graph, while still keeping the representative structure and features of the original graph for ...

متن کامل

Visualization of Small World Networks Using Similarity Matrices

Visualization of small world networks is challenging owing to the large size of the data and its property of being “locally dense but globally sparse.” Generally networks are represented using graph layouts and images of adjacency matrices, which have shortcomings of occlusion and spatial complexity in its direct form. These shortcomings are usually alleviated using pixel displays, hierarchical...

متن کامل

A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization

Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping node problem, large graph layout and dynamic graph layout. In order to solve these problems, this paper aims to systematically address algorithmic issues related to a novel framework that describes the process of graph ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0712.1549  شماره 

صفحات  -

تاریخ انتشار 2007